///
// * jdbm LICENSE v1.00
// *
// * Redistribution and use of this software and associated documentation
// * ("Software"), with or without modification, are permitted provided
// * that the following conditions are met:
// *
// * 1. Redistributions of source code must retain copyright
// *    statements and notices.  Redistributions must also contain a
// *    copy of this document.
// *
// * 2. Redistributions in binary form must reproduce the
// *    above copyright notice, this list of conditions and the
// *    following disclaimer in the documentation and/or other
// *    materials provided with the distribution.
// *
// * 3. The name "jdbm" must not be used to endorse or promote
// *    products derived from this Software without prior written
// *    permission of Cees de Groot.  For written permission,
// *    please contact cg@cdegroot.com.
// *
// * 4. Products derived from this Software may not be called "jdbm"
// *    nor may "jdbm" appear in their names without prior written
// *    permission of Cees de Groot.
// *
// * 5. Due credit should be given to the jdbm Project
// *    (http://jdbm.sourceforge.net/).
// *
// * THIS SOFTWARE IS PROVIDED BY THE ndbm PROJECT AND CONTRIBUTORS
// * ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT
// * NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
// * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL
// * CEES DE GROOT OR ANY CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
// * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
// * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
// * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
// * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
// * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
// * OF THE POSSIBILITY OF SUCH DAMAGE.
// *
// * Copyright 2000 (C) Cees de Groot. All Rights Reserved.
// * Contributions are Copyright (C) 2000 by their associated contributors.
// *
// 

//*************************************************************************
//**  Included in JDMB 1.0 port to SharpDBM;  11/2013 Cyrus Neah cneah@codingreal.com
//**  SharpDBM is an independent reimplementation of the JDBM 1.0 software library  
//*************************************************************************

using System;
using SharpDBM;
using SharpDBM.recman;
using SharpDBM.helper;
using SharpDBM.btree;



namespace SharpDBM.Test

.htree
{

	using RecordManager = SharpDBM.RecordManager;

	using BaseRecordManager = SharpDBM.recman.BaseRecordManager;
    using TestRecordFile = SharpDBM.Test.recman.TestRecordFile;
    

	using NUnit.Framework;
    using SharpDBM.htree;

///
// *  Test cases for HTree rollback
// 
    [TestFixture]
    public class TestRollback  
	{


        [Test]
		public virtual void setUp()
		{
			TestRecordFile.deleteTestFile();
		}
        [Test]
		public virtual void tearDown()
		{
			TestRecordFile.deleteTestFile();
		}

//    *
//     * Test case courtesy of Derek Dick (mailto:ddick@users.sourceforge.net)
//     
 
//
        [Test]
        public virtual void testRollback1()
		{
			RecordManager recman;
			long root;

		// Note: We start out with an empty file
			recman = new BaseRecordManager(TestRecordFile.testFileName);

		root = recman.getNamedObject("xyz");

			HTree tree = null;
			if (root == 0)
			{
			// create a new one
				tree = HTree.createInstance(recman);
				root = tree.getRecid();
				recman.setNamedObject("xyz", root);
				recman.commit();
			}
			else
			{
				tree = HTree.load(recman, root);
			}

			tree.put("Foo", "Bar");
			tree.put("Fo", "Fum");

			recman.commit();

			tree.put("Hello", "World");

			recman.rollback();

			tree = HTree.load(recman, root);
			NUnit.Framework.Assert.IsTrue(tree.get("Foo").Equals("Bar"));
			NUnit.Framework.Assert.IsTrue(tree.get("Fo").Equals("Fum"));
			NUnit.Framework.Assert.IsTrue(tree.get("Hello") == null);
		}


//    *
//     * Test case courtesy of Derek Dick (mailto:ddick@users.sourceforge.net)
//     
 
//
        [Test]
        public virtual void testRollback2()
		{
			RecordManager recman;
			long root;

		// Note: We start out with an empty file
			recman = new BaseRecordManager(TestRecordFile.testFileName);

		root = recman.getNamedObject("xyz");

			HTree tree = null;
			if (root == 0)
			{
			// create a new one
				tree = HTree.createInstance(recman);
				root = tree.getRecid();
				recman.setNamedObject("xyz", root);
				recman.commit();
			}
			else
			{
				tree = HTree.load(recman, root);
			}

			tree.put("hello", "world");
			tree.put("goodnight", "gracie");
			recman.commit();

			tree.put("derek", "dick");
            tree.remove("derek");
            tree.get("derek");
			recman.rollback();
            tree.get("derek");
			NUnit.Framework.Assert.IsTrue(tree.get("derek") == null);
			NUnit.Framework.Assert.IsTrue(tree.get("goodnight").Equals("gracie"));
			NUnit.Framework.Assert.IsTrue(tree.get("hello").Equals("world"));
		}


//    *
//     *  Runs all tests in this class
//     
		static void Main(string[] args)
		{
			// junit.textui.TestRunner.run(new TestSuite(typeof(TestRollback)));
		}
	}

}